TECHNICAL REPORT 97-01 A Novel Approach to Multiprogrammed Multiprocessor Synchronization for Real-Time Kernels
نویسندگان
چکیده
In order to solve the problem of inopportune preemption in multiprogrammed multiprocessor synchronization, two strategies which are applicable to real-time systems have been investigated: preemption-safe locking and wait-free synchronization. Either of them, however, has a problem for use in the implementation of a real-time kernel. Preemption-safe locking has the drawback that the preemption overhead becomes quite large; while wait-free operations on complex data structures are generally very ine cient and are not practical. In this paper, we propose a novel approach to multiprogrammed multiprocessor synchronization, called the SPEPP (Spinning Processor Executes for Preempted Processors) synchronization, with which the preemption overhead can be reduced to zero, while operations on complex data structures can be realized with reasonable overhead. This paper presents the two algorithms of the SPEPP synchronization, and demonstrates its e ectiveness through the performance measurements of a real-time kernel implemented with the SPEPP synchronization. ANY OTHER IDENTIFYING INFORMATION OF THIS REPORT DISTRIBUTION STATEMENT First issue 45 copies. This technical report is available via anonymous FTP from ftp.is.s.u-tokyo.ac.jp (directory /pub/tech-reports). SUPPLEMENTARY NOTES REPORT DATE January 29, 1997 TOTAL NO. OF PAGES 13 WRITTEN LANGUAGE English NO. OF REFERENCES 11 DEPARTMENT OF INFORMATION SCIENCE Faculty of Science, University of Tokyo 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan A Novel Approach to Multiprogrammed Multiprocessor Synchronization for Real-Time Kernels Hiroaki Takada Ken Sakamura Department of Information Science, The University Museum, School of Science, University of Tokyo University of Tokyo Technical Report 97-01
منابع مشابه
Concurrent Update on Multiprogrammed Shared Memory Multiprocessors
Most multiprocessors are multiprogrammed in order to achieve acceptable response time and to increase utilization. Unfortunately, inopportune preemption may significantly degrade the performance of synchronized parallel applications. To address this problem, researchers have developed two principal strategies for concurrent, atomic update of shared data structures: preemption-safe locking and n...
متن کاملPragmatische nichtblockierende Synchronisation für Echtzeitsysteme Dissertation
In this thesis I present a pragmatic methodology for designing nonblocking real-time systems. My methodology uses a combination of lock-free and wait-free synchronization techniques and clearly states which technique should be applied in which situation. This thesis reports novel results in various respects: My approach restricts the usage of lock-free mechanisms to cases where the widely avail...
متن کاملRelative Performance of Preemption-Safe Locking and Non-Blocking Synchronization on Multiprogrammed Shared Memory Multiprocessors
Most multiprocessors are multiprogrammed to achieve acceptable response time. Unfortunately, inopportune preemption may significantly degrade the performance of synchronized parallel applications. To address this problem, researchers have developed two principal strategies for concurrent, atomic update of shared data structures: (1) preemption-safe locking and (2) non-blocking (lock-free) algor...
متن کاملReal-time Prediction and Synchronization of Business Process Instances using Data and Control Perspective
Nowadays, in a competitive and dynamic environment of businesses, organizations need to moni-tor, analyze and improve business processes with the use of Business Process Management Systems(BPMSs). Management, prediction and time control of events in BPMS is one of the major chal-lenges of this area of research that has attracted lots of researchers. In this paper, we present a...
متن کامل